Review of Job Scheduling Algorithms for Proportional Sharing in Grid Computing

Grid is a collection of heterogeneous systems or heterogeneous objects that are geographically distributed over a network. Job management is one of the chaotic issues of grid environment. For effective utilization of the resources in grid systems, efficient application/job scheduling methods are required. Job scheduling algorithms are commonly applied by grid resource managers to optimally dispatch tasks to grid resources. Typically, grid users submit their own jobs to the grid manager to take full advantage of the grid facilities. The grid manager in a grid system tries to distribute the submitted jobs amongst the grid resources in such a way that the total response time is minimized. Similarly, there is an additional issue of providing fair share to each application of individual users according to their priority by the grid manager. There are various fair job scheduling algorithms which provided better proportional sharing accuracy. However, the time to select a client for execution using these algorithms grows with the number of clients. Most implementations require linear time to select a client for execution. In this paper, discussion on various job scheduling algorithms has been done which provide better proportional sharing accuracy. This paper is divided into 6 sections. First section, describes basic introduction to grid computing and its functioning. Second section, describes about the how user’s job(s) are scheduled. Third section, describes about the various type of job scheduling algorithms. Fourth and fifth sections of this paper wind up the work with a general conclusion about the problem and future scope of the work.